Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for Min-Max Tree Partition
We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP. We present an O n time algorithm for the problem, where n is the number of nodes in the graph. A...
متن کاملImproved Approximation for Min-Sum Vertex Cover
The paper describes an approximation algorithm for the Min Sum Vertex Cover (MSVC) problem, achieving a constant approximation factor strictly smaller than 2, thus improving on the best currently known approximation algorithm for the problem. ∗Department of Computer Science and Applied Mathematics, The Weizmann Institute of Science, Rehovot 76100, Israel. E-mail: [email protected]. †Depar...
متن کاملApproximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
Using ideas and results from polynomial approximation and exact computation we design approximation algorithms for several NP-hard combinatorial problems achieving ratios that cannot be achieved in polynomial time (unless a very unlikely complexity conjecture is confirmed) with worst-case complexity much lower (though super-polynomial) than that of an exact computation. We study in particular m...
متن کاملApproximation algorithms for metric tree cover and generalized tour and tree covers
Given a weighted undirected graph G = (V, E), a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of G. Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5...
متن کاملGame Tree Searching by Min/Max Approximation
We present an iterative method for searching minlmax game trees based on the idea of approximating the “min” and “max” operators by generalized mean-valued operators. This approximation is useci to guide the selection of the next leaf node to expand, since the approximations allow one to select ejficiently that leaf node upon whose value the (approximate) value at the root most highly depends. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2013
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9740-5